منابع مشابه
Completion theorem for uniform entropy
Modifying Bowen’s entropy, we introduce a new uniform entropy. We prove that the completion theorem for uniform entropy holds in the class of all metric spaces. However, the completion theorem for Bowen’s entropy does not hold in the class of all totally bounded metric spaces.
متن کاملLocalic completion of uniform spaces
We extend the notion of localic completion of generalised metric spaces by Steven Vickers to the setting of generalised uniform spaces. A generalised uniform space (gus) is a set X equipped with a family of generalised metrics on X, where a generalised metric on X is a map from X ×X to the upper reals satisfying zero self-distance law and triangle inequality. For a symmetric generalised uniform...
متن کاملOn the Completion of Uniform Convergence Spaces and an Application to Nonlinear Pdes
We obtain a characterization of the completion of an initial uniform convergence structure, which includes, among others, subspaces and projective limits of uniform convergence spaces. In this regard, there seems to be a gap in the literature. This characterization is obtained in a surprisingly straightforward way, and this should be viewed as a consequence of the fact that the category UCS of ...
متن کاملOn the Completion Monad via the Yoneda Embedding in Quasi-uniform Spaces
Making use of the presentation of quasi-uniform spaces as generalised enriched categories, and employing in particular the calculus of modules, we define the Yoneda embedding, prove a (weak) Yoneda Lemma, and apply them to describe the Cauchy completion monad for quasi-uniform spaces.
متن کاملMinimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch∗
In this paper, we consider the scheduling problem of minimizing total weighted completion time on uniform machines with unbounded batch. Each of the machine Ml (l = 1, ⋅ ⋅ ⋅ ,m) has a speed sl and can process up to B(≥ n) jobs simultaneously as a batch. The processing time of a batch denoted by P(B) is given by the processing time of the longest job in it, and the running time of the batch on m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1967
ISSN: 1385-7258
DOI: 10.1016/s1385-7258(67)50018-5